Implementation of Gang-Scheduling on Workstation Cluster
نویسندگان
چکیده
The goal of this paper is to determine how e ciently we can implement an adequate parallel programming environment on a workstation cluster without modifying the existing operating system. We have implemented a runtime environment for parallel programs and gang-scheduling on a workstation cluster. In this paper, we report the techniques used to implement gang-scheduling on a workstation cluster and the problems we faced. The most important technique is \network preemption" and a unique feature of our approach is that the gang-scheduling is also written in a parallel language. Our evaluation shows that gangscheduling on workstation clusters can be practical.
منابع مشابه
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling techniques are necessary that enable parallel applications to dynamically share workstations with their owners. In this paper a special type of parallel applications called gangs are considered. Gangs are jobs that consist...
متن کاملOverhead Analysis of Preemptive Gang Scheduling
A preemptive gang scheduler is developed and evaluated. The gang scheduler, called SCoreD , is implemented on top of a UNIX operating system and runs on workstation and PC clusters connected by Myrinet, a giga-bit class, high-performance network. To have high-performance communication at the user-level and a multiuser environment simultaneously, we propose network preemption to save and restore...
متن کاملOverhead Analysis of Preemptive
A preemptive gang scheduler is developed and evaluated. The gang scheduler, called SCoreD , is implemented on top of a UNIX operating system and runs on workstation and PC clusters connected by Myrinet, a giga-bit class, high-performance network. To have high-performance communication at the user-level and a multiuser environment simultaneously, we propose network preemption to save and restore...
متن کاملImplications of I/O for Gang Scheduled Workloads
This paper examines the implications of gang scheduling for generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often require gang scheduling, and I/O-bound jobs, which require high CPU priority to achieve interactive response times. Our results indicate that an effective interactive multiprocessor scheduler must weigh both the ben...
متن کاملGang scheduling in heterogenous distributed systems
⎯ This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple ar...
متن کامل